2D cellular automata: expansivity and decidability issues
نویسندگان
چکیده
In this paper we introduce the notion of quasi-expansivity for 2D CA and we show that it shares many properties with expansivity (that holds only for 1D CA). Similarly, we introduce the notions of quasi-sensitivity and prove that the classical dichotomy theorem holds in this new setting. Moreover, we show a tight relation between closingness and openness for 2D CA. Finally, the undecidability of closingness property for 2D CA is proved.
منابع مشابه
2D cellular automata: dynamics and undecidability
In this paper we introduce the notion of quasi-expansivity for 2D CA and we show that it shares many properties with expansivity (that holds only for 1D CA). Similarly, we introduce the notions of quasisensitivity and prove that the classical dichotomy theorem holds in this new setting. Moreover, we show a tight relation between closingness and openness for 2D CA. Finally, the undecidability of...
متن کاملPre-Expansivity in Cellular Automata
We introduce the property of pre-expansivity for cellular automata (CA): it is the property of being expansive on asymptotic pairs of configurations (i.e. configurations that differ in only finitely many positions). Pre-expansivity therefore lies between expansivity and pre-injectivity, two important notions of CA theory. We show that there exist one-dimensional pre-expansive CAs which are not ...
متن کاملNon-Uniform Cellular Automata: classes, dynamics, and decidability
The dynamical behavior of non-uniform cellular automata is compared with the one of classical cellular automata. Several differences and similarities are pointed out by a series of examples. Decidability of basic properties like surjectivity and injectivity is also established. The final part studies a strong form of equicontinuity property specially suited for non-uniform cellular automata.
متن کاملThe Dynamics of Cellular Automata in Shift-Invariant Topologies
We study the dynamics of cellular automata, and more specifically their transitivity and expansivity, when the set of configurations is endowed with a shift-invariant (pseudo-)distance. We first give an original proof of the non-transitivity of cellular automata when the set of configurations is endowed with the Besicovitch pseudo-distance. We then show that the Besicovitch pseudo-distance indu...
متن کاملCombinatorial constructions associated to the dynamics of one-sided cellular automata
In this paper we study combinatorial constructions which lead to one-sided invertible cellular automata with di5erent dynamical behavior: equicontinuity, existence of equicontinuous points but not equicontinuity, sensitivity and expansivity. In particular, we provide a simple characterization of the class of equicontinuous invertible one-sided cellular automata and we construct families of expa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0906.0857 شماره
صفحات -
تاریخ انتشار 2009